Discovery and Analysis of E-Government Business Processes with Process Mining: a case study

One of the biggest challenges in performing a Process Mining (PM) initiative is the data availability since business processes (BPs) are usually implicit within the organization’s information systems supporting them or by BPMS platforms with the process and organizational data distributed across heterogeneous databases within the organization. Moreover, in e-Government, inter-organizational collaborative business processes have traces of execution spread across several organizations. The main objective of this paper is to describe a case study on applying PM to e-Government business processes traced by an existing centralized traceability system, using our methodology for organizational data science. We provided a step-by-step analysis answering fundamental questions about their execution and evaluating improvement opportunities of the traceability system to strengthen PM initiatives

Evaluating Non-Functional Aspects of Business Process Management Systems

Selecting a Business Process Management Systems (BPMS) for an organization is not a trivial task. It requires a thorough evaluation of its capabilities considering the whole support of the business process lifecycle and the organizational environment in which the BPMS will be used. In this context, in a previous work we have proposed a methodology for the systematic evaluation of BPMS, which was mostly focused on required functional and non-technical aspects. In this paper, we present the extension of our methodology with a detailed definition of non-functional aspects to be evaluated, and a set of test cases for their evaluation. We also performed a fine tuning of the methodology based on a comprehensive comparison with other existent methodologies and the provision of tool support. As a case study, we present an evaluation of open source and proprietary BPMS following our proposal.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Process Mining for Improving Urban Mobility in Smart Cities: Challenges and Application with Open Data

Urban mobility presents various challenges to favor urban development. These challenges have been traditionally analyzed using transport network optimization and simulation techniques. Nevertheless, it is possible to think of process mining as a complementary approach allowing, among other things, to discover behavioral transportation models, obtain execution measures and detect bottlenecks. The objective of this article is to analyze how suitable PM is for the analysis of urban mobility problems. We use open data from the Metropolitan Transportation System (STM) of Montevideo, Uruguay, which, among other things, provides the ability to record up-to-date information on its transportation network and trips of its citizens. We apply process mining to process discovery, both from buses and their users, and carry out various analyses linking such data with time information, costs, types of users, and city areas

UML 2.0 interactions with OCL/RT constraints

The use of formal methods at early stages of software development contributes to the reliability and robustness of the system to be constructed. Int his context, real-time system development benefits from the construction of behavioral models in order to verify the correct satisfaction of time constraints. The Unified Modeling Language (UML) is a software specification language widely used by the industry and the academia. Nevertheless, its version 2.0 lacks a formal semantics for the development of provably-correct models. In addition, its constraint specification language, Object Constraint Language (OCL), has limitations for its use in behavioral models of real-time systems. This work concerns the inter-component behavioral specification of real-time systems. Such behavior is described using the UML 2.0 Interactions language extended for the inclusion of time constraints using the OCL for Real Time (OCL/RT) language. The main problem addressed in this work is the definition of a formal semantics for the fusion of both languages. The semantics allows recognizing valid and invalid behaviors of a system with time constraints. Intended for formal verification, an analysis of the properties derived from the semantics is also done. In particular, the notions of refinement of interactions and refinement of constraints are explored. Finally, the proposal is compared with related works and its practical application is studied in order to analyze its benefits and weaknesses. This work contributes to the formalization of concepts widely used in practice and, inconsequence, to its inclusion in modeling and formal reasoning tools. More-over, the expressivity of the UML 2.0 Interactions language is augmented in order to support complex real-time constraints, not expressable until this moment

Evaluating Non-Functional Aspects of Business Process Management Systems

Selecting a Business Process Management Systems (BPMS) for an organization is not a trivial task. It requires a thorough evaluation of its capabilities considering the whole support of the business process lifecycle and the organizational environment in which the BPMS will be used. In this context, in a previous work we have proposed a methodology for the systematic evaluation of BPMS, which was mostly focused on required functional and non-technical aspects. In this paper, we present the extension of our methodology with a detailed definition of non-functional aspects to be evaluated, and a set of test cases for their evaluation. We also performed a fine tuning of the methodology based on a comprehensive comparison with other existent methodologies and the provision of tool support. As a case study, we present an evaluation of open source and proprietary BPMS following our proposal.Sociedad Argentina de Informática e Investigación Operativa (SADIO

Heterogeneous verification of model transformations

Esta tesis trata sobre la verificación formal en el contexto de la Ingeniería Dirigida por Modelos (MDE por sus siglas en inglés). El paradigma propone un ciclo de vida de la ingeniería de software basado en una abstracción de su complejidad a través de la definición de modelos y en un proceso de construcción (semi)automático guiado por transformaciones de estos modelos. Nuestro propósito es abordar la verificación de transformaciones de modelos la cual incluye, por extensión, la verificación de sus modelos. Comenzamos analizando la literatura relacionada con la verificación de transformaciones de modelos para concluir que la heterogeneidad de las propiedades que interesa verificar y de los enfoques para hacerlo, sugiere la necesidad de utilizar diversos dominios lógicos, lo cual es la base de nuestra propuesta. En algunos casos puede ser necesario realizar una verificación heterogénea, es decir, utilizar diferentes formalismos para la verificación de cada una de las partes del problema completo. Además, es beneficioso permitir a los expertos formales elegir el dominio en el que se encuentran más capacitados para llevar a cabo una prueba formal. El principal problema reside en que el mantenimiento de múltiples representaciones formales de los elementos de MDE en diferentes dominios lógicos, puede ser costoso si no existe soporte automático o una relación formal clara entre estas representaciones. Motivados por esto, definimos un entorno unificado que permite la verificación formal transformaciones de modelos mediante el uso de métodos de verificación heterogéneos, de forma tal que es posible automatizar la traducción formal de los elementos de MDE entre dominios logicos. Nos basamos formalmente en la Teoría de Instituciones, la cual proporciona una base sólida para la representación de los elementos de MDE (a través de instituciones) sin depender de ningúningún dominio lógico específico. También proporciona una forma de especificar traducciones (a través de comorfismos) que preservan la semántica entre estos elementos y otros dominios lógicos. Nos basamos en estándares para la especificación de los elementos de MDE. De hecho, definimos una institución para la buena formación de los modelos especificada con una versión simplificada del MetaObject Facility y otra institución para transformaciones utilizando Query/View/Transformation Relations. No obstante, la idea puede ser generalizada a otros enfoques de transformación y lenguajes.Por último, demostramos la viabilidad del entorno mediante el desarrollo de un prototipo funcional soportado por el Heterogeneous Tool Set (HETS). HETS permite realizar una especificación heterogénea y provee facilidades para el monitoreo de su corrección global. Los elementos de MDE se conectan con otras lógicas ya soportadas en HETS (por ejemplo: lógica de primer orden, lógica modal, entre otras) a través del Common Algebraic Specification Language (CASL). Esta conexión se expresa teóricamente mediante comorfismos desde las instituciones de MDE a la institución subyacente en CASL. Finalmente, discutimos las principales contribuciones de la tesis. Esto deriva en futuras líneas de investigación que contribuyen a la adopción de métodos formales para la verificación en el contexto de MDE.This thesis is about formal verification in the context of the Model-Driven Engineering (MDE) paradigm. The paradigm proposes a software engineering life-cycle based on an abstraction from its complexity by defining models, and on a (semi)automatic construction process driven by model transformations. Our purpose is to address the verification of model transformations which includes, by extension, the verification of their models. We first review the literature on the verification of model transformations to conclude that the heterogeneity we find in the properties of interest to verify, and in the verification approaches, suggests the need of using different logical domains, which is the base of our proposal. In some cases it can be necessary to perform a heterogeneous verification, i.e. using different formalisms for the verification of each part of the whole problem. Moreover, it is useful to allow formal experts to choose the domain in which they are more skilled to address a formal proof. The main problem is that the maintenance of multiple formal representations of the MDE elements in different logical domains, can be expensive if there is no automated assistance or a clear formal relation between these representations. Motivated by this, we define a unified environment that allows formal verification of model transformations using heterogeneous verification approaches, in such a way that the formal translations of the MDE elements between logical domains can be automated. We formally base the environment on the Theory of Institutions, which provides a sound basis for representing MDE elements (as so called institutions) without depending on any specific logical domain. It also provides a way for specifying semantic-preserving translations (as so called comorphisms) from these elements to other logical domains. We use standards for the specification of the MDE elements. In fact, we define an institution for the well-formedness of models specified with a simplified version of the MetaObject Facility, and another institution for Query/View/Transformation Relations transformations. However, the idea can be generalized to other transformation approaches and languages. Finally, we evidence the feasibility of the environment by the development of a functional prototype supported by the Heterogeneous Tool Set (HETS). HETS supports heterogeneous specifications and provides capabilities for monitoring their overall correctness. The MDE elements are connected to the other logics already supported in HETS (e.g. first-order logic, modal logic, among others) through the Common Algebraic Specification Language (CASL). This connection is defined by means of comorphisms from the MDE institutions to the underlying institution of CASL. We carry out a final discussion of the main contributions of this thesis. This results in future research directions which contribute with the adoption of formal tools for the verification in the context of MDE

Experiment with a type-theoretic approach to the verification of model transformations

"This paper presents ongoing work on the application of constructive type theory for safe development in Model-Driven Engineering. In particular, we put into practice a certification framework based on the Calculus of Inductive Constructions (CIC) as follows: we first describe methods for representing metamodels and specifications of model transformations as types and then outline principles for representing given transformations, written in a certain transformation language, as functions in CIC. Then properties of these functions are proven, including their correctness with respect to sufficiently expressive specifications, thereby providing a semiformal way to verify the original transformations. We carry out a concrete case taken from an on-line base of basic examples and patterns of use of the ATL transformation language, implementing it on machine using the Coq proof assistant." [Abstract

A type-theoretic framework for certified model transformations

"We present a framework based on the Calculus of Inductive Constructions (CIC) and its associated tool the Coq proof assistant to allow certification of model transformations in the context of Model-Driven Engineering (MDE). The approached is based on a semi-automatic translation process from metamodels, models and transformations of the MDE technical space into types, propositions and functions of the CIC technical space. We describe this translation and illustrate its use in a standard case study." [Abstract

Produtos da excreção-secreção e proteases da fase leveduriforme do Sporothrix schenckii: detecção imunológica e clivagem de IgG humana

Antigenic preparations from Sporothrix schenckii usually involve materials from mixed cultures of yeast and mycelia presenting cross-reactions with other deep mycoses. We have standardized pure yeast phase with high viability of the cells suitable to obtain specific excretion-secretion products without somatic contaminations. These excretion-secretion products were highly immunogenic and did not produce noticeable cross-reactions in either double immunodiffusion or Western blot. The antigenic preparation consists mainly of proteins with molecular weights between 40 and 70 kDa, some of them with proteolytic activity in mild acidic conditions. We also observed cathepsin-like activity at two days of culture and chymotrypsin-like activity at four days of culture consistent with the change in concentration of different secreted proteins. The proteases were able to cleave different subclasses of human IgG suggesting a sequential production of antigens and molecules that could interact and interfere with the immune response of the host.As preparações antigênicas de Sporothrix schenckii provêm geralmente de cultivos mistos de leveduras e micélios e apresentam reações cruzadas com outras micoses profundas. Foi padronizada a obtenção da fase leveduriforme pura, com alto índice de células viáveis, o que permite, por sua vez, obter produtos específicos da excreção-secreção sem contaminantes somáticos. Estes produtos da excreção-secreção são altamente imunogênicos, e não apresentam reações cruzadas visíveis em dupla difusão e sem Western blot. O preparado antigênico consiste principalmente em proteínas com peso molecular entre 40 e 70 kDa, sendo que algumas apresentam atividade proteolítica em meios levemente ácidos. Foi observada atividade do tipo catepsina em produtos da excreção-secreção obtidos a partir de leveduras de dois dias de cultivo, e atividade do tipo quimiotripsina aos quatro dias de cultivo, consistente com a mudança de concentração de proteínas secretadas. As proteases puderam clivar diferentes subclasses de IgG humanas, o que sugere uma produção seqüencial de antígenos e moléculas que podem interagir com a resposta imune do hospedeiro

Evaluating Non-Functional Aspects of Business Process Management Systems

Selecting a Business Process Management Systems (BPMS) for an organization is not a trivial task. It requires a thorough evaluation of its capabilities considering the whole support of the business process lifecycle and the organizational environment in which the BPMS will be used. In this context, in a previous work we have proposed a methodology for the systematic evaluation of BPMS, which was mostly focused on required functional and non-technical aspects. In this paper, we present the extension of our methodology with a detailed definition of non-functional aspects to be evaluated, and a set of test cases for their evaluation. We also performed a fine tuning of the methodology based on a comprehensive comparison with other existent methodologies and the provision of tool support. As a case study, we present an evaluation of open source and proprietary BPMS following our proposal.Sociedad Argentina de Informática e Investigación Operativa (SADIO